Efficient mesh optimization schemes based on Optimal Delaunay Triangulations
نویسندگان
چکیده
Article history: Received 15 April 2010 Received in revised form 2 November 2010 Accepted 10 November 2010 Available online 16 November 2010
منابع مشابه
Mesh Smoothing Schemes Based on Optimal Delaunay Triangulations
We present several mesh smoothing schemes based on the concept of optimal Delaunay triangulations. We define the optimal Delaunay triangulation (ODT) as the triangulation that minimizes the interpolation error among all triangulations with the same number of vertices. ODTs aim to equidistribute the edge length under a new metric related to the Hessian matrix of the approximated function. Theref...
متن کاملGeometric Aspects of the Space of Triangulations
These are the notes of my talk presented in the colloquium on discrete curvature at the CIRM, in Luminy (France) on November 21st, 2013, in which we study the space of triangulations from a purely geometric point of view and revisit the results presented in [21] and [20] (joint works with Patrick Mullen, Fernando De Goes and Mathieu Desbrun). Motivated by practical numerical issues in a number ...
متن کاملA highly-effective incremental/decremental Delaunay mesh-generation strategy for image representation
A flexible mesh-generation framework for image representation based on Delaunay triangulations is proposed. By fixing the various degrees of freedom available within this framework, two mesh-generation methods, known as ID1 and ID2, are derived. These two methods are shown to perform extremely well, producing meshes of significantly higher quality than state-of-the-art schemes at relatively low...
متن کاملFast Updating of Delaunay Triangulation of Moving Points by Bi-cell Filtering
Updating a Delaunay triangulation when data points are slightly moved is the bottleneck of computation time in variational methods for mesh generation and remeshing. Utilizing the connectivity coherence between two consecutive Delaunay triangulations for computation speedup is the key to solving this problem. Our contribution is an effective filtering technique that confirms most bi-cells whose...
متن کاملParametrization of Generalized Primal-Dual Triangulations
Motivated by practical numerical issues in a number of modeling and simulation problems, we introduce the notion of a compatible dual complex to a primal triangulation, such that a simplicial mesh and its compatible dual complex (made out of convex cells) form what we call a primal-dual triangulation. Using algebraic and computational geometry results, we show that compatible dual complexes exi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010